package algorithm;

public class leetcode_0072 {
    public int minDistance(String word1, String word2) {
        int len1=word1.length();
        int len2=word2.length();
        char[] list1=word1.toCharArray();
        char[] list2=word2.toCharArray();
        int [][] dp=new int[len1+1][len2+1];
        for(int i=0;i<len1+1;++i){
            dp[i][0]=i;
        }
        for(int j=0;j<len2+1;++j){
            dp[0][j]=j;
        }
        for(int i=1;i<len1+1;++i){
            for(int j=1;j<len2+1;++j){
                if(list1[i-1]==list2[j-1]){
                    dp[i][j]=dp[i-1][j-1];
                }
                else{
                    dp[i][j]=min(dp[i-1][j-1]+1,dp[i-1][j]+1,dp[i][j-1]+1);
                }
            }
        }
        return dp[len1][len2];
    }
    public int min(int a,int b,int c){
        if(a<b){
            return (a>c)?c:a;
        }
        else{
            return (b>c)?c:b;
        }
    }
}
